Перевод: с английского на русский

с русского на английский

relativized theorem

См. также в других словарях:

  • Post's theorem — In computability theory Post s theorem, named after Emil Post, describes the connection between the arithmetical hierarchy and the Turing degrees. Background The statement of Post s theorem requires several concepts relating to definability and… …   Wikipedia

  • Hyperarithmetical theory — In recursion theory, hyperarithmetic theory is a generalization of Turing computability. It has close connections with definability in second order arithmetic and with weak systems of set theory such as Kripke–Platek set theory. It is an… …   Wikipedia

  • Modal logic — is a type of formal logic that extends classical propositional and predicate logic to include operators expressing modality. Modals words that express modalities qualify a statement. For example, the statement John is happy might be qualified by… …   Wikipedia

  • Absoluteness (mathematical logic) — In mathematical logic, a formula is said to be absolute if it has the same truth value in each of some class of structures (also called models). Theorems about absoluteness typically show that each of a large syntactic class of formulas is… …   Wikipedia

  • Computable function — Total recursive function redirects here. For other uses of the term recursive function , see Recursive function (disambiguation). Computable functions are the basic objects of study in computability theory. Computable functions are the formalized …   Wikipedia

  • science, philosophy of — Branch of philosophy that attempts to elucidate the nature of scientific inquiry observational procedures, patterns of argument, methods of representation and calculation, metaphysical presuppositions and evaluate the grounds of their validity… …   Universalium

  • World view — A comprehensive world view (or worldview) is a term calqued from the German word Weltanschauung (Audio IPA|De Weltanschauung.ogg| [ˈvɛlt.ʔanˌʃaʊ.ʊŋ] ) Welt is the German word for world , and Anschauung is the German word for view or outlook. It… …   Wikipedia

  • Low (complexity) — In computational complexity theory, it is said that a complexity class B is low for a complexity class A if A B = A ; that is, A with an oracle for B is equal to A . Such a statement implies that an abstract machine which solves problems in A… …   Wikipedia

  • Van Kampen diagram — In the mathematical area of geometric group theory, a van Kampen diagram is a planar diagram used to represent the fact that a particular word among the generators of a group given by a group presentation represents the identity element in that… …   Wikipedia

  • Causality — (but not causation) denotes a necessary relationship between one event (called cause) and another event (called effect) which is the direct consequence (result) of the first. [http://dictionary.reference.com/search?q=Causality x=35 y=25 Random… …   Wikipedia

  • Arithmetical hierarchy — In mathematical logic, the arithmetical hierarchy, arithmetic hierarchy or Kleene hierarchy classifies certain sets based on the complexity of formulas that define them. Any set that receives a classification is called arithmetical. The… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»